Triad Machine ; A General Computational Model for the Description of Abstract Machines
Identifieur interne : 00C413 ( Main/Exploration ); précédent : 00C412; suivant : 00C414Triad Machine ; A General Computational Model for the Description of Abstract Machines
Auteurs : Z. Benaissa ; Pierre Lescanne [France]Source :
English descriptors
Abstract
This paper presents a generic abstract machine called the triad machine. Here {\it generic} means that the general framework can be instantiated to simulate the behavior of several kinds of machines. Moreover, the triad machine presents two original features. First, instead of structured objects like environments and stacks in classical abstract machines, its basic components are addresses that refer to triads. Second, the triad machine makes a clear difference between rules which modify the state of the machine and strategies which schedule the rules. Strategies maybe deterministic or not, like in concurrent strategies. The rules are given once for all but the strategies can vary. A strategy is a higher order parameter of the triad machine.
Affiliations:
- France
- Grand Est, Lorraine (région)
- Nancy
- Centre national de la recherche scientifique, Institut national de recherche en informatique et en automatique, Laboratoire lorrain de recherche en informatique et ses applications, Université de Lorraine
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 001727
- to stream Crin, to step Curation: 001727
- to stream Crin, to step Checkpoint: 002C25
- to stream Main, to step Merge: 00CC70
- to stream Main, to step Curation: 00C413
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="328">Triad Machine ; A General Computational Model for the Description of Abstract Machines</title></titleStmt><publicationStmt><idno type="RBID">CRIN:benaissa95a</idno><date when="1995" year="1995">1995</date><idno type="wicri:Area/Crin/Corpus">001727</idno><idno type="wicri:Area/Crin/Curation">001727</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">001727</idno><idno type="wicri:Area/Crin/Checkpoint">002C25</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">002C25</idno><idno type="wicri:Area/Main/Merge">00CC70</idno><idno type="wicri:Area/Main/Curation">00C413</idno><idno type="wicri:Area/Main/Exploration">00C413</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Triad Machine ; A General Computational Model for the Description of Abstract Machines</title><author><name sortKey="Benaissa, Z" sort="Benaissa, Z" uniqKey="Benaissa Z" first="Z." last="Benaissa">Z. Benaissa</name></author><author><name sortKey="Lescanne, P" sort="Lescanne, P" uniqKey="Lescanne P" first="P." last="Lescanne">Pierre Lescanne</name><affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="region" nuts="2">Lorraine (région)</region></placeName><orgName type="laboratoire" n="5">Laboratoire lorrain de recherche en informatique et ses applications</orgName><orgName type="university">Université de Lorraine</orgName><orgName type="institution">Centre national de la recherche scientifique</orgName><orgName type="institution">Institut national de recherche en informatique et en automatique</orgName></affiliation></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>extention for parallelism</term><term>run-time system and garbage collection</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="982">This paper presents a generic abstract machine called the triad machine. Here {\it generic} means that the general framework can be instantiated to simulate the behavior of several kinds of machines. Moreover, the triad machine presents two original features. First, instead of structured objects like environments and stacks in classical abstract machines, its basic components are addresses that refer to triads. Second, the triad machine makes a clear difference between rules which modify the state of the machine and strategies which schedule the rules. Strategies maybe deterministic or not, like in concurrent strategies. The rules are given once for all but the strategies can vary. A strategy is a higher order parameter of the triad machine.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Nancy</li></settlement><orgName><li>Centre national de la recherche scientifique</li><li>Institut national de recherche en informatique et en automatique</li><li>Laboratoire lorrain de recherche en informatique et ses applications</li><li>Université de Lorraine</li></orgName></list><tree><noCountry><name sortKey="Benaissa, Z" sort="Benaissa, Z" uniqKey="Benaissa Z" first="Z." last="Benaissa">Z. Benaissa</name></noCountry><country name="France"><region name="Grand Est"><name sortKey="Lescanne, P" sort="Lescanne, P" uniqKey="Lescanne P" first="P." last="Lescanne">Pierre Lescanne</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00C413 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00C413 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:benaissa95a
|texte= Triad Machine ; A General Computational Model for the Description of Abstract Machines
}}
| This area was generated with Dilib version V0.6.33. |  |